Singularity Analysis of Generating Functions

نویسندگان

  • Philippe Flajolet
  • Andrew M. Odlyzko
چکیده

This work presents a class of methods by which one can translate, on a term-by-term basis, an asymptotic expansion of a function around a dominant singularity into a corresponding asymptotic expansion for the Taylor coefficients ofthe function. This approach is based on contour integration using Cauchy’s formula and Hankel-like contours. It constitutes an alternative to either Darboux’s method or Tauberian theorems that appears to be well suited to combinatorial enumerations, and a few applications in this area are outlined. Key words, asymptotic analysis, generating functions, combinatorial enumeration AMS(MOS) subject classifications. 05, 40, 68

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums Singularity Analysis and Asymptotics of Bernoulli Sums

The asymptotic analysis of a class of binomial sums that arise in information theory can be performed in a simple way by means of singularity analysis of generating functions. The method developed extends the range of applicability of singularity analysis techniques to combinatorial sums involving transcendental elements like logarithms or fractional powers. Analyse de singularit e et asymptoti...

متن کامل

A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics

A “hybrid method”, dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux’s method and singularity analysis theory. This hybrid method applies to functions that remain of moderate growth near the unit circle and satisfy suitable smoothness assumptions—this, even in the case when the unit circle is a natural boundary. A prime ap...

متن کامل

Random Polynomials andPolynomial

We give a precise average-case analysis of a complete polynomial factorization chain over nite elds by methods based on generating functions and singularity analysis. Polyn^ omes al eatoires et factorisation de polyn^ omes R esum e Nous donnons une analyse en moyenne pr ecise d'une cha^ ne compl ete de factorisation de polyn^ omes sur les corps nis par des m ethodes fond ees sur les fonctions g...

متن کامل

Batcher's odd-even exchange revisited: A generating functions approach

The celebrated odd-even exchange algorithm by Batcher provides the quantity average number of exchanges, which was a mystery a few years ago and is still tricky today. We provide an approach that is purely based on generating functions to provide an explicit expression. The asymptotic analysis was done several years ago but never published in a journal and is thus provided here. It is a combina...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1990